Notions of Monad Strength
نویسنده
چکیده
Over the past two decades the notion of a strong monad has found wide applicability in computing. Arising out of a need to interpret products in computational and semantic settings, different approaches to this concept have arisen. In this paper we introduce and investigate the connections between these approaches and also relate the results to monad composition. We also introduce new methods for checking and using the required laws associated with such compositions, as well as provide examples illustrating problems and issues that arise.
منابع مشابه
Quantalic Topological Theories
The paper proposes the notions of topological platform and quantalic topological theory for the presentation and investigation of categories of interest beyond the realm of algebra. These notions are nevertheless grounded in algebra, through the notions of monad and distributive law. The paper shows how they entail previously proposed concepts with similar goals.
متن کاملCompletion, Closure, and Density Relative to a Monad, with Examples in Functional Analysis and Sheaf Theory
Given a monad T on a suitable enriched category B equipped with a proper factorization system (E ,M ), we define notions of T-completion, T-closure, and T-density. We show that not only the familiar notions of completion, closure, and density in normed vector spaces, but also the notions of sheafification, closure, and density with respect to a Lawvere-Tierney topology, are instances of the giv...
متن کاملGeneral Operads and Multicategories
Notions of ‘operad’ and ‘multicategory’ abound. This work provides a single framework in which many of these various notions can be expressed. Explicitly: given a monad ∗ on a category S , we define the term (S , ∗)multicategory, subject to certain conditions on S and ∗. Different choices of S and ∗ give some of the existing notions. We then describe the algebras for an (S , ∗)-multicategory an...
متن کاملNotions of Computation Determine Monads
We model notions of computation using algebraic operations and equations. We show that these generate several of the monads of primary interest that have been used to model computational effects, with the striking omission of the continuations monad. We focus on semantics for global and local state, showing that taking operations and equations as primitive yields a mathematical relationship tha...
متن کاملAffine Monads and Side-Effect-Freeness
The notions of side-effect-freeness and commutativity are typical for probabilistic models, as subclass of quantum models. This paper connects these notions to properties in the theory of monads. A new property of a monad (‘strongly affine’) is introduced. It is shown that for such strongly affine monads predicates are in bijective correspondence with side-effect-free instruments. Also it is sh...
متن کامل